The Fluent Calculus A Specification Language for Robots with Sensors in Nondeterministic, Concurrent, and Ramifying Environments
نویسنده
چکیده
منابع مشابه
From Discrete Task Plans to Continuous Trajectories
We present a logic-based framework to provide robots with high-level reasoning, such as planning. This framework uses the action description language C+ to represent actions and changes, and the system CCALC to reason about them. In particular, we can represent action domains that involve concurrent actions and additive fluents; based on this description, we can compute shortest plans to a plan...
متن کاملFluent Calculus-Based Semantic Web Service Composition and Verification Using WSSL
We propose a composition and verification framework for Semantic Web Services specified using WSSL, a novel service specification language based on the fluent calculus, that addresses issues related to the frame, ramification and qualification problems. These deal with the succinct and flexible representation of non-effects, indirect effects and preconditions, respectively. The framework exploi...
متن کاملNon-determinism and Probabilities in Timed Concurrent Constraint Programming (Extended Version)
We set the grounds of a framework for modeling and verifying systems involving probabilities, time, and partial information as constraints. A timed concurrent constraint process calculus with probabilistic and non-deterministic choices is proposed as description language. An operational semantics ensures consistent interactions between both kinds of choices. The semantics is also shown to be in...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملA Calculus for Predicative Programming
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are well known from the specification language Z. All elements of a simple sequential programming notation are defined in terms of predicates. Hence programs form a subset of specifications. In particular, sequential com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000